Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products
نویسندگان
چکیده
We present a new protocol for efficient distributed computation modulo a shared secret. We further present a protocol to distributively generate a random shared prime or safe prime that is much more efficient than previously known methods. This allows to distributively compute shared RSA keys, where the modulus is the product of two safe primes, much more efficiently than was previously known.
منابع مشابه
Control and Cybernetics Contemporary Cryptology
The book here reviewed consists of several articles written by different authors. We provide below short characteristics of each of the articles in the book. 1. Efficient distributed computation modulo a shared secret (Dario Catalano) The article concerns the subject of distributed computation. This is realized by the secret sharing protocols. The author presents several kinds of such protocols...
متن کاملGBD Threshold Cryptography with an Application to RSA Key Recovery
We present protocols for threshold decryption and threshold key generation in the GBD public-key cryptosystem in the “honest-butcurious” setting. These allow GBD computations to be performed in a distributed manner during both key generation and decryption, without revealing the private key to any party. GBD threshold decryption is similar to El-Gamal threshold decryption. GBD threshold key gen...
متن کاملGBD Threshold Cryptography with an Application to RSA Key Recovery
We present protocols for threshold cryptography in the GBD public-key cryptosystem. Both threshold decryption and threshold key generation are covered, in the “honest-butcurious” setting. This shows that it is possible to perform GBD computations in a distributed manner during both key generation and decryption, without revealing the private key to any party. GBD threshold decryption is similar...
متن کاملEfficient Dealer-Less Threshold Sharing of Standard RSA
In [15] an efficient two-party, two-prime RSA function sharing protocol was proposed. The protocol proves efficiency over previously proposed protocols. When the sharing of standard RSA is considered, the protocol is faster than ever. In this paper, under the assumption that the adversary has eavesdropping and halting capabilities, we propose an efficient extension to the protocol of [15]. Our ...
متن کاملAn Efficient Anonymous Group Identification Scheme with Short Secret Keys
We suggest to use short secret keys in the anonymous group identification scheme proposed by Lee, Deng, and Zhu [7] and prove that this scheme is secure under the discrete logarithm with short exponents assumption that solving the discrete logarithm problem modulo an n-bit prime p is hard even when the exponent is a small c-bit number. We show that the communication and the computation costs ar...
متن کامل